Generating trees and forbidden subsequences
نویسنده
چکیده
We discuss an enumerative technique called generating frees which was introduced in the study of Baxter permutations. We apply the technique to some other classes of permutations with forbidden subsequences. We rederive some known results, e.g. ]S,(132,231)[ = 2” and l&,(123,132,213)1 = F,, and add several new ones: &(123,3241), S,(123,3214),8,(123,2143). Finally, we argue for the broader use of generating trees in combinatorial enumeration.
منابع مشابه
Permutations with forbidden subsequences and nonseparable planar maps
The goal of the present work is to connect combinatorially a family of maps to a family of permutations with forbidden subsequences. We obtain a generating tree of nonseparable planar rooted maps and show that this tree is the generating tree of a family of permutations. The distribution of these permutations is then obtained. Finally, the different steps leading to the combinatorial proof of W...
متن کاملDirected animals, forests and permutations
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive description of these structures from which we deduce their generating function, according to various parameters: the area, the right half-width and the number of compact sources. We determine the average number of compact s...
متن کاملForbidden subsequences and Chebyshev polynomials
In (West, Discrete Math. 157 (1996) 363-374) it was shown using transfer matrices that the number [Sn(123; 3214)1 of permutations avoiding the pattems 123 and 3214 is the Fibonacci number F2, (as are also IS,(213; 1234)1 and 1S~(213;4123)1 ). We now find the transfer matrix for IS , (123;r , r 1 . . . . . 2,1,r + 1)1, IS,(213;1,2 . . . . . r , r + 1)1, and ISn(213;r + 1,1,2 . . . . . r)l, deter...
متن کاملSources of Superlinearity in Davenport-Schinzel Sequences
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length of such sequences. Following Klazar, let Ex(σ, n) be the maximum length of a sequence over an alphabet of size n avoiding subsequences isomorphic to σ. It ha...
متن کاملOrigins of Nonlinearity in Davenport-Schinzel Sequences
A generalized Davenport-Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental problem in this area is bounding the maximum length of such sequences. Following Klazar, we let Expσ, nq be the maximum length of a sequence over an alphabet of size n excluding subsequences isomorphic to σ. It has been proved that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 1996